Substitutions, Finite Automata and Number Systems
نویسندگان
چکیده
منابع مشابه
Finite Substitutions and Integer Weighted Finite Automata
In this work we present a new chain of undecidability reductions, which begins from the classical halting problem of Turing machines and ends to the undecidability proof of the equivalence problem for nite substitutions on regular languages in Chapter 4. This undecidability result was originally proved by L. Lisovik in 1997. We present a new proof, which is shorter and more elementary than the ...
متن کاملCanonical Number Systems, Counting Automata and Fractals
In this paper we study properties of the fundamental domain Fβ of number systems, which are defined in rings of integers of number fields. First we construct addition automata for these number systems. Since Fβ defines a tiling of the n-dimensional vector space, we ask, which tiles of this tiling “touch” Fβ . It turns out, that the set of these tiles can be described with help of an automaton, ...
متن کاملOstrowski Numeration Systems, Addition and Finite Automata
We present an elementary three pass algorithm for computing addition in Ostrowski numerations systems. When a is quadratic, addition in the Ostrowski numeration system based on a is recognizable by a finite automaton. We deduce that a subset of X ⊆Nn is definable in (N,+,Va), where Va is the function that maps a natural number x to the smallest denominator of a convergent of a that appears in t...
متن کاملFinite Dynamical Systems, Linear Automata, and Finite Fields
We establish a connection between finite fields and finite dynam-ical systems. We show how this connection can be used to shed light on some problems in finite dynamical systems and in particular, in linear systems.
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Progress of Theoretical Physics
سال: 1992
ISSN: 0033-068X
DOI: 10.1143/ptp.88.211